An Epistemic Logic of Situations

نویسنده

  • Paul F. Syverson
چکیده

In this paper we present a first order epistemic logic that incorporates the essentially finite character of what is actually known by any knower. Our logic and language allows us to represent familiarity with individuals including individual situations. It is also a logic of l imited awareness in the manner of [FH88]. It is adequate for the syntactic characterization of the shared-si tuat ion account of common knowledge [Bar89]. Finally, it is sound and complete with respect to the presented semantics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Semantics for a Logical Language for the Game of Dominoes

Epistemic logic allows to reason not only about situations, but also about the knowledge that a set of agents have about situations. In later years, epistemic logic has been applied to study the role of knowledge in games and negotiations. The classical approach, the mathematical theory of games, does not facilitate explicit reasoning about the knowledge of the agents that interact in competiti...

متن کامل

The Complexity of Epistemic Model Checking: Clock Semantics and Branching Time

In the clock semantics for epistemic logic, two situations are indistinguishable for an agent when it makes the same observation and the time in the situations is the same. The paper characterizes the complexity of model checking branching time logics of knowledge in finite state systems with respect to the clock semantics.

متن کامل

An Algebraic Approach to Dynamic Epistemic Logic

Dynamic epistemic logic plays a key role in reasoning about multi-agent systems. Past approaches to dynamic epistemic logic have typically been focused on actions whose primary purpose is to communicate information from one agent to another. These actions are unable to alter the valuation of any proposition within the system. In fields such as security, it is easy to imagine situations in which...

متن کامل

KE Tableaux for Public Announcement Logic

Public announcement logic (PAL) is a simple dynamic epistemic logic extending reasoning about knowledge of agents with a modal operator for simultaneous and transparent knowledge updates. This logic is no more expressive than epistemic logic (EL) without updates, but exhibits compact representation of a number of complex epistemic situations. A labeled tableau proof system to reason with these ...

متن کامل

PAC vs. DEMAL

Since the work of Plaza (1989) about acts of public communication, a lot of dynamic epistemic logic systems have emerged. A general state of the art can be found in van Ditmarsch et al. (2007). Such logics model situations in which some announcements can bemade and after an announcement, the situations which are incompatible with it are deleted from the model. In this paper we propose a reconst...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994